package test.niuke;

public class RrWeiJuZhen {
    public static void main(String[] args) {



        int[][] matrix = new int[][] { { 0, 1, 2, 3, 4, 5, 6 },// 0
                { 10, 12, 13, 15, 16, 17, 18 },// 1
                { 23, 24, 25, 26, 27, 28, 29 },// 2
                { 44, 45, 46, 47, 48, 49, 50 },// 3
                { 65, 66, 67, 68, 69, 70, 71 },// 4
                { 96, 97, 98, 99, 100, 111, 122 },// 5
                { 166, 176, 186, 187, 190, 195, 200 },// 6
                { 233, 243, 321, 341, 356, 370, 380 } // 7
        };
        int K = 233;

        System.out.println(System.currentTimeMillis());
        for (int i = 0; i < matrix.length; i++) {
            for (int j = 0; j < matrix[i].length; j++) {
                if(matrix[i][j]==K){
                    System.out.println(i+"-"+j+"==>yes");
                }

            }
        }

        System.out.println(System.currentTimeMillis());

        System.out.println(isContains111(matrix, K));
        System.out.println(System.currentTimeMillis());
    }

    public static boolean isContains111(int[][] matrix, int K) {

        int row=0;
        int col=0;
        while (row<matrix.length&&col<matrix[0].length - 1){
            if(matrix[row][col]==K){
             return true;
            }
            if(matrix[row][col]<K){
                col++;
            }else {
                row++;
            }

        }
        return false;
    }
    public static boolean isContains(int[][] matrix, int K) {
        int row = 0;
        int col = matrix[0].length - 1;
        while (row < matrix.length && col > -1) {
            if (matrix[row][col] == K) {
                return true;
            } else if (matrix[row][col] > K) {
                col--;
            } else {
                row++;
            }
        }
        return false;
    }


}
